Ill-Conditioned Inclusions
نویسنده
چکیده
A square system of linear equations is ‘ill-conditioned’ when the norm of the corresponding inverse matrix is large. This norm bounds the size of the solution, and measures how close the system is to being inconsistent: it is thus of fundamental computational significance. We generalize this idea from linear equations to inclusions governed by closed convex processes, and hence to ‘conic linear systems’. Mathematics Subject Classifications (2000): Primary: 15A12, 90C31; Secondary: 65F35, 46A30.
منابع مشابه
Predicting surgical case durations using ill-conditioned CPT code matrix
Efficient utilization of existing resources is crucial for cost containment in medical institutions. Accurately predicting surgery duration will improve the utilization of indispensable surgical resources such as surgeons, nurses, and operating rooms. Prior research has identified the current procedural terminology (CPT) codes as the most important factor when predicting surgical case durations...
متن کاملError bounds for extremely ill-conditioned problems
We discuss methods to compute error bounds for extremely ill-conditioned problems. As a model problem we treat matrix inversion. We demonstrate that additive corrections to improve an approximate inverse are useful for ill-conditioned problems, but hardly usable for extremely ill-conditioned problems. Here multiplicative corrections can be used, including the possibility to compute guaranteed e...
متن کاملCombined reconstruction of fluorescent and optical parameters using time-resolved data.
We present an algorithm for simultaneous reconstruction of optical parameters, quantum yield, and lifetime in turbid media with embedded fluorescent inclusions. This algorithm is designed in the Fourier domain as an iterative solution of a system of differential equations of the Helmholtz type and does not involve full ill-conditioned matrix computations. The approach is based on allowing the u...
متن کاملIll-conditioned linear equations and its algorithm
In this paper, according to the characteristics of ill-conditioned linear equations. An improved Wilkinson algorithm(IWA) for solving ill-conditioned linear equations is proposed. An amendment factor is introduced to reduce the condition number of the coefficient matrix of ill-conditioned linear equations. An automatic step size is adopted to estimate the local error and change the step size co...
متن کاملHadamard multiplexed fluorescence tomography.
Depth-resolved three-dimensional (3D) reconstruction of fluorophore-tagged inclusions in fluorescence tomography (FT) poses a highly ill-conditioned problem as depth information must be extracted from boundary data. Due to the ill-posed nature of the FT inverse problem, noise and errors in the data can severely impair the accuracy of the 3D reconstructions. The signal-to-noise ratio (SNR) of th...
متن کامل